A Quadtree-Based Dynamic Attribute Indexing Method

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Quadtree-Based Dynamic Attribute Indexing Method

Dynamic attributes are attributes that change continuously over time making it impractical to issue explicit updates for every change. In this paper, we adapt a variant of the quadtree structure to solve the problem of indexing dynamic attributes. The approach is based on the key idea of using a linear function of time for each dynamic attribute that allows us to predict its value in the future...

متن کامل

A New Method for Quadtree Triangulation

The aim of the study is to increase the accuracy of a terrain triangulation while maintaining or reducing the number of triangles. To this end, a new non-trivial algorithm for quadtree triangulation is proposed. The proposed algorithm includes: i) a resolution parameters calculation technique and ii) three error metric calculation techniques. Simulation software is also devised to apply the pro...

متن کامل

A New Quadtree-Based Symmetry Transform (QST) With Application to Arab-andalusian images Indexing

This paper describes a new method for the Arab-andalusian images features extraction for indexing. Our original approach is based on the extraction of symmetry information using a quadtree-based symmetry Transform (QST). Our method is inspired by the way that the artits (Maalam) draw the shapes of the patterns. We build a quadtree on the image center then we give a measure of symmetry, a featur...

متن کامل

Indexing of the Discrete Global Grid Using Linear Quadtree

In recent years a method of recursive subdivisions of the triangular faces of the octahedron or icosahedron has been developed for approximating to the surface of the earth. But the triangle-based discrete grids produced by this method are complicated in geometry structure, and is difficult to make such geographical operations as neighbor-finding, spatial searches and so on. In this paper we co...

متن کامل

Time split linear quadtree for indexing image databases

The Time Split B-Tree (TSBT) is modified for indexing a database of evolving binary images. This is accomplished by embedding ideas from Linear region Quadtrees that make the TSBT able to support spatio-temporal query processing. To improve query performance, additional pointers are added to the leaf-nodes of the TSBT. The resulting access method is called Time Split Linear Quadtree (TSLQ). Alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1998

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/41.3.185